GloMIQO: Global mixed-integer quadratic optimizer
نویسندگان
چکیده
منابع مشابه
GloMIQO: Global mixed-integer quadratic optimizer
This paper introduces the Global Mixed-Integer Quadratic Optimizer, GloMIQO, a numerical solver addressing mixed-integer quadratically-constrained quadratic programs (MIQCQP) to ε-global optimality. The algorithmic components are presented for: reformulating user input, detecting special structure including convexity and edge-concavity, generating tight convex relaxations, partitioning the sear...
متن کاملMINTO, a mixed INTeger optimizer
MINTO is a software system that solves mixed integer linear programs by a branch and bound algorithm with linear programming relaxations It also provides automatic constraint classi cation preprocessing primal heuristics and constraint generation Moreover the user can enrich the basic algorithm by providing a variety of specialized application routines that can customize MINTO to achieve maximu...
متن کاملANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations
This manuscript introduces ANTIGONE, Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations, a general mixed-integer nonlinear global optimization framework. ANTIGONE is the evolution of the Global Mixed-Integer Quadratic Optimizer, GloMIQO, to general nonconvex terms. The purpose of this paper is to show how the extensible structure of ANTIGONE realizes our previously-p...
متن کاملFunctional description of MINTO, a Mixed INTeger Optimizer Version 3.1
MINTO is a software system that solves mixed-integer linear programs by a branch-and-bound algorithm with linear programming relaxations. It also provides automatic constraint classification, preprocessing, primal heuristics and constraint generation. Moreover, the user can enrich the basic algorithm by providing a variety of specialized application routines that can customize MINTO to achieve ...
متن کاملReformulating Mixed-Integer Quadratically Constrained Quadratic Programs
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather than merely relax them. The purpose of reformulation is to strengthen the continuous relaxation of the problem, while leaving the optimal solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2012
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-012-9874-7